A new cross-correlation and constant modulus type algorithm for PAM-PSK signals
نویسندگان
چکیده
We address the problem of blind recovery of multiple sources from their linear convolutive mixture with the cross-comelation and constant modulus algorithm. The steady state meansquared error of this algorithm is first derived to justify the proposal of a new cross-correlation and constant modulus type algorithm for PAM-PSK type non-constant modulus signals. Simulation studies are presented to support the improved steady-state performance of the new algorithm.
منابع مشابه
A Simplified Constant Modulus Algorithm for Blind Recovery of MIMO QAM and PSK Signals: A Criterion with Convergence Analysis
The problem of blind recovery of QAM and PSK signals for multiple-input multiple-output (MIMO) communication systems is investigated. We propose a simplified version of the well-known constant modulus algorithm (CMA), named simplified CMA (SCMA). The SCMA cost function consists in projection of the MIMO equalizer outputs on one dimension (either real or imaginary part). A study of stationary po...
متن کاملCramer-Rao lower bounds for QAM phase and frequency estimation
In this paper, we present the true Cramér–Rao lower bounds (CRLBs) for the estimation of phase offset for common quadrature amplitude modulation (QAM), PSK, and PAM signals in AWGN channels. It is shown that the same analysis also applies to the QAM, PSK, and PAM CRLBs for frequency offset estimation. The ratio of the modulated to the unmodulated CRLBs is derived for all QAM, PSK, and PAM signa...
متن کاملBlind Equalization Technique for Cross Correlation Constant Modulus Algorithm (CC-CMA)
Equalization plays an important role for the communication system receiver to correctly recover the symbol send by the transmitter, where the received signals may contain additive noise and intersymbol interference (ISI). Blind equalization is a technique of many equalization techniques at which the transmitted symbols over a communication channel can be recovered without the aid of training se...
متن کاملFinite sample identifiability of multiple constant modulus source
We prove that mixtures of continuous alphabet constant modulus sources can be identified with probability 1 with a finite number of samples (under noise-free conditions). This strengthens earlier results which only considered an infinite number of samples. The proof is based on the linearization technique of the analytical constant modulus algorithm (ACMA), together with a simple inductive argu...
متن کاملOptimum delay and mean square error using CMA
The performance of the Constant Modulus Algorithm can su er because of the existence of local minimawith large Mean Squared Error(MSE). This paper presents a new way of obtaining the optimumMSE over all delays using a second equalizer under a mixed Constant Modulus and Cross Correlation Algorithm (CM-CCA). Proof of convergence is obtained for the noiseless case. Simulations demonstrate the pote...
متن کامل